Graphs, flags and partitions
نویسنده
چکیده
This paper defines, for each graph G, a flag vector fG. The flag vectors of the graphs on n vertices span a space whose dimension is p(n), the number of partitions on n. The analogy with convex polytopes indicates that the linear inequalities satisfied by fG may be both interesting and accessible. Such would provide inequalities both sharp and subtle on the combinatorial structure of G. These may be related to Ramsey theory.
منابع مشابه
k-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملValidity of Selected WBC Differentiation Flags in Sysmex XT-1800i
Background: Automatic Cell Counter devises make the CBC differential very easy and delivering the results in few second. However, the problem with this device is facing a flag requires a time-consuming microscopic review of the specimen which causes unacceptable wait times for patient as well as costs for laboratories. In this study, we calculated the validity of WBC d...
متن کاملAn Experimental Evaluation of Point-To-Point Shortest Path Calculation on Road Networks with Precalculated Edge-Flags
We present an efficient algorithm for fast and exact calculation of shortest paths in graphs with geometrical information in nodes (coordinates), e.g. road networks. The method is based on preprocessing and therefore best suited for static graphs, i.e., graphs with fixed topology and edge costs. In the preprocessing phase, the network is divided into regions and edge flags are calculated that i...
متن کاملCharacterization of Essential Graphs by Means of an Operation of Legal Component Merging
One of the most common ways of representing classes of equivalent Bayesian networks is the use of essential graphs. These chain graphs are also known in the literature as completed patterns or completed pdags. The name essential graph was proposed by Andersson, Madigan and Perlman (1997a) who also gave a graphical characterization of essential graphs. In this contribution an alternative charact...
متن کاملFlag Varieties and Interpretations of Young Tableau Algorithms
The conjugacy classes of nilpotent n × n matrices can be parametrised by partitions λ of n, and for a nilpotent η in the class parametrised by λ, the variety Fη of η-stable flags has its irreducible components parametrised by the standard Young tableaux of shape λ. We indicate how several algorithmic constructions defined for Young tableaux have significance in this context, thus extending Stei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998